Beyond Finite Domains: The All Different and Global Cardinality Constraints
نویسندگان
چکیده
We describe how the propagator for the All-Different constraint can be generalized to prune variables whose domains are not just simple finite integer domains. We show, for example, how it can be used to propagate set, multiset and tuple variables.
منابع مشابه
The All Different and Global Cardinality Constraints on Set, Multiset and Tuple Variables
We describe how the propagator for the All-Different constraint can be generalized to prune variables whose domains are not just simple finite domains. We show, for example, how it can be used to propagate set variables, multiset variables and variables which represent tuples of values. We also describe how the propagator for the global cardinality constraint (which is a generalization of the A...
متن کاملReformulation of Global Constraints in Answer Set Programming
We show that global constraints on finite domains like alldifferent can be reformulated into answer set programs on which we achieve arc, bound or range consistency. These reformulations offer a number of other advantages beyond providing the power of global propagators to answer set programming. For example, they provide other constraints with access to the state of the propagator by sharing v...
متن کاملJust How Many Languages Are There?
Optimality Theory assumes the candidate set generated for any given input is of infinite cardinality. If all of the candidates in the candidate set were potential winners (optimal candidates under some ranking), then OT would have predicted an infinite typology— there would be infinitely many possible languages. However, Samek-Lodovici and Prince (1999) have shown that in standard OT (with only...
متن کاملEfficient Propagators for Global Constraints
We study in this thesis three well known global constraints. The All-Different constraint restricts a set of variables to be assigned to distinct values. The global cardinality constraint (GCC) ensures that a value v is assigned to at least lv variables and to at most uv variables among a set of given variables where lv and uv are non-negative integers such that lv ≤ uv. The Inter-Distance cons...
متن کاملar X iv : 1 10 4 . 25 41 v 1 [ cs . A I ] 1 3 A pr 2 01 1 Kernels for Global Constraints ∗
Bessière et al. (AAAI’08) showed that several intractable global constraints can be efficiently propagated when certain natural problem parameters are small. In particular, the complete propagation of a global constraint is fixed-parameter tractable in k – the number of holes in domains – whenever bound consistency can be enforced in polynomial time; this applies to the global constraints AtMos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005